The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
نویسندگان
چکیده
منابع مشابه
The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
A random walk on a finite graph can be used to construct a uniform random spanning tree. We show how random walk techniques can be applied to the study of several properties of the uniform random spanning tree: the proportion of leaves, the distribution of degrees, and the diameter.
متن کاملNon-Uniform Random Spanning Trees on Weighted Graphs
We study random walks on undirected graphs with weighted edges. Our main result shows that any spanning tree deened by the edges corresponding to a rst visit of a vertex, appears with a probability proportional to its weight, which is the product of the weights of its edges. This provides an algorithm for generating non uniform random spanning trees in a weighted graph. The technique used here ...
متن کاملLoop Erased Walks and Uniform Spanning Trees
The uniform spanning tree has had a fruitful history in probability theory. Most notably, it was the study of the scaling limit of the UST that led Oded Schramm [Sch00] to introduce the SLE process, work which has revolutionised the study of two dimensional models in statistical physics. But in addition, the UST relates in an intrinsic fashion with another model, the loop erased random walk (or...
متن کاملUniform spanning trees on Sierpiński graphs
We study spanning trees on Sierpiński graphs (i.e., finite approximations to the Sierpiński gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpiński graph and show that this construction gives rise to a multi-type Galton-Watson tree. We derive a number of structural results, for instance on the degree distribution....
متن کاملRooted Uniform Monotone Minimum Spanning Trees
We study the construction of the minimum cost spanning geometric graph of a given rooted point set P where each point of P is connected to the root by a path that satisfies a given property. We focus on two properties, namely the monotonicity w.r.t. a single direction (y-monotonicity) and the monotonicity w.r.t. a single pair of orthogonal directions (xy-monotonicity). We propose algorithms tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 1990
ISSN: 0895-4801,1095-7146
DOI: 10.1137/0403039